#include"filedesc.h"

#define BST_TRUE 1
#define BST_FALSE 0


b_node *bst_root;

b_node *bst_create();
/*Creates the bst, returns the root b_node*/

b_node *bst_search( b_node *bst_root, char *fullpath );

/*searches the BST on the basis of fullpath and returns the searched node*/
int bst_insert ( b_node **bst_root,fd *data );


/* insert the bst node and returns root */
int bst_delete(b_node **bst_root,char *fullpath);

/* deletes the bst node and returns root */
/*Prints the bst*/
void print_inorder(b_node *bst_root);







